Substitutive Systems and a Finitary Version of Cobham’s Theorem

نویسندگان

چکیده

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of are substitutive. As an application we obtain a complete characterisation the sets words can appear as common factors two automatic sequences defined over multiplicatively independent bases. This generalises famous theorem Cobham.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a finitary version of mathematical analysis

An approach to constructing counterparts of some #elds of mathematical analysis in the frames of Pilbert’s “#nitary standpoint” is sketched in this paper. This approach is based on certain results of functional spaces theory development in classical mathematics. c © 2002 Elsevier Science B.V. All rights reserved. MSC: 03A05; 03F60; 26E40; 46S30

متن کامل

A More General Version of the Costa Theorem

In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...

متن کامل

A FUZZY VERSION OF HAHN-BANACH EXTENSION THEOREM

In this paper, a fuzzy version of the analytic form of Hahn-Banachextension theorem is given. As application, the Hahn-Banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.

متن کامل

Finitary formal topologies and Stone's representation theorem

We study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theo...

متن کامل

A Finitary Version of the Calculus of Partial Inductive Defintions

The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2021

ISSN: ['0209-9683', '1439-6912']

DOI: https://doi.org/10.1007/s00493-020-4311-x